Spatial mixing and nonlocal Markov chains
نویسندگان
چکیده
منابع مشابه
Spatial Mixing and Systematic Scan Markov chains
We consider spin systems on the integer lattice graph Z with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the strong spatial mixing condition (SSM), implies rapid mixing of a large class of Markov chains. As a first application of our method we prove that SSM implies O(log n) mixing o...
متن کاملSpatial Mixing and Non-local Markov chains
We consider spin systems with nearest-neighbor interactions on an n-vertex d-dimensional cube of the integer lattice graph Z. We study the e ects that exponential decay with distance of spin correlations, speci cally the strong spatial mixing condition (SSM), has on the rate of convergence to equilibrium distribution of non-local Markov chains. We prove that SSM implies O(log n) mixing of a blo...
متن کاملRapidly-mixing Markov Chains
INTRODUCTION Andrei Andreyevich Markov was a Russian mathematician born in 1856. Markov's main interests were in number theory, continued fractions, and approximation theory. He studied under P. Chebyshev and worked in the field of probability theory. Markov pioneered work in the area of stochastic processes by creating a model called a Markov chain—a random walk on a state space. His work has ...
متن کاملMarkov chains and mixing times
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities. Elements of S can be interpreted as various possible states of whatever system we are interested in studying, and pij represents the probability that the system is in state j at time n+ 1, if it is sta...
متن کاملMarkov Chains and Mixing Times
Titles in this series are co-published with the Mathematical Sciences Research Institute (MSRI).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2019
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20844